Method and apparatus for processing authentication request message in a social network

ABSTRACT

A method and an apparatus for processing an authentication request message in a social network are provided. To improve the inefficiency of existing technology in processing user authentication and request to establish social relationship as well as inadequacy of parameters available for said authentication, the disclosed method includes a social network server detecting an authentication request message sent by a first client to a second client requesting to establish a social relationship with the second client. The social network server obtains information social attributes that are common to the first client and the second client, forwards the authentication request message, and sends the obtained information of common social attributes to the second client. The social attribute information is used by the second client to decide whether or not to authenticate the authentication request message.

CROSS REFERENCE TO RELATED PATENT APPLICATIONS

This application is a national stage application of an internationalpatent application PCT/US10/34509, filed May 12, 2010, which claimspriority from Chinese Patent Application No. 200910147252.6, filed Jun.12, 2009, entitled “METHOD AND APPARATUS FOR PROCESSING AUTHENTICATIONREQUEST MESSAGE IN A SOCIAL NETWORK,” which applications are herebyincorporated in their entirety by reference.

TECHNICAL FIELD

The present disclosure relates to Internet-based technologies and, moreparticularly, to a method and an apparatus for processing authenticationrequest messages in a social network.

BACKGROUND

In the existing Internet-based environment, the social network formed byonline netizens has evolved beyond the simple connection betweenindividual subscribers, and involves one-to-many and many-to-manyrelationships. A social network includes online users and their relatednetworks, such as instant message (IM) systems and Internet SNS (SocialNetwork Service) communities based on WEB2.0. Taking an IM applicationfor example, before its subscribers intercommunicate and exchangeinformation through their respective IM clients, the IM applicationtypically requires certain bilateral social network relationship betweenthe subscribers who are about to communicate with each other, in orderto accelerate orientation of communicating parties and preventsubscribers from sending spam information and/or harassing messages. Inlight of the rules of the current IM applications, when user A intendsto initiate communication with user B who is not within his/her socialrelationship table, it is necessary for user A to ask for user B'sconsent to build a certain social relationship. To that end, user Atypically sends user B an authentication request message, whichexpresses his/her intention to be a subscriber having certain socialrelationship with user B. Only when user B authenticates user A'sauthentication request message, will user A be allowed to access user Bthrough user A's social relationship table and initiate communicationwith user B.

During the process where user A applies to be a user having certainsocial relationship with user B, the only way for user B to know aboutuser A's identification and other information by which user B can decidewhether or not to build the social relationship with user A is throughthe authentication request message manually input by user A. In otherwords, traditionally, the authentication request message is completelysubject to user A's manual input, and it is impossible for the system toautomatically acquire user A's identification and the socialrelationship between user A and user B. On one hand, this causesinefficiency in building social relationship between two subscribers. Onthe other hand, there is no way to provide sufficient parameter for userB to make decision about user A's authentication request message.

SUMMARY

In order to resolve the problems of the inefficiency in confirmingrequest to establish social relationship by a user and inadequacy ofparameter provided for authentication under existing technologies, oneembodiment of the present disclosure provides a method for processing anauthentication request message in a social network. The method includesthe following:

providing a social network server which, upon detecting a first clientsending an authentication request message to a second client requestingto establish a social relationship with the second client, obtainscommon social attribute information of the first client and the secondclient, wherein social attribute information indicates attributes of auser in the social network; and

the social network server forwarding the authentication request messageto the second client and sending the obtained social attributeinformation, wherein the social attribute information is used by thesecond client to authenticate the authentication request message.

Another embodiment of the present disclosure provides an apparatus forprocessing an authentication request message in a social network. Theapparatus comprises the following:

an acquisition module that obtains an authentication request messagesent by a first client to a second client requesting to establish asocial relationship with the second client, and obtains common socialattribute information of the first client and the second client, whereinsocial attribute information indicates attributes of a user in thesocial network; and

a sending module that forwards the authentication request message andthe obtained social attribute information to the second client, whereinthe social attribute information is used by the second client toauthenticate the authentication request message.

Through the embodiments of the present disclosure as recited above, whendetecting that the first client sends an authentication request messageto the second client requesting to establish a social relationship withthe second client, the social network server automatically obtains thecommon social attribute information of the first client and the secondclient, and presents it to the second client. This increases theparameters according to which the second client decides whether or notto authenticate the authentication request message from the firstclient. This also improves the efficiency in establishing social networkrelationship between the first client and the second client.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a network topology diagram in accordance with a firstembodiment of the present disclosure.

FIG. 2 is a flow chart of a method in accordance with a first embodimentof the present disclosure.

FIG. 3 is a schematic drawing showing a relationship chain in a socialnetwork of the present disclosure.

FIG. 4 is a flow chart of a method in accordance with a secondembodiment of the present disclosure.

FIG. 5 is a structural diagram of an apparatus in accordance with athird embodiment of the present disclosure.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

A first embodiment of the present disclosure provides a method 100 forprocessing an authentication request message in a social network. Asimplemented in the network topology of FIG. 1, the network includes asocial network server and a plurality of clients. The method 100 asshown in FIG. 2 comprises actions described below.

At 101, client A sends an authentication request message to client Bthrough a social network server to establish a social networkrelationship with client B.

At 102, after detecting client A sending the authentication requestmessage to client B to establish a social network relationship, thesocial network server acquires identification information of client Aand identification information of client B.

At 103, according to the identification information of client A andidentification information of client B, the social network serverdetermines server 1 from among a plurality of servers as the serverhaving stored thereon an inverted index with index record keyword of(A-B), “AB” or “(AB)”.

At 104, from server 1, the social network server extracts the indexrecords having keyword (A-B), to obtain information of common socialattributes of client A and client B, or to extract relationship chaininformation between client A and client B.

At 105, the social network server sends to client B the extractedinformation of common social attributes or the common relationship chaininformation.

At 106, client B displays the received information of common socialattributes of client A and client B or the extracted common relationshipchain information.

At 101, the client B stores one or more social relationship tableslocally. For example, Social Relationship Table 1, shown below, includesthe identity of five client identities and their corresponding socialrelationship categories. Each of clients C, D, E, F and G has a socialrelationship with client B in the category 1. Social Relationship Table2, shown below, includes the identity of three clients and theircorresponding social relationship categories, each of which is category2. Table 1 serves to store the client identities of category 1 whileTable 2 stores the client identities of category 2.

TABLE 1 Client Identity Social Relationship Category C 1 D 1 E 1 F 1 G 1

TABLE 2 Client Identity Social Relationship Category H 2 I 2 J 2

Client A, through the social network server, sends the authenticationrequest message to the client B to be included in Table 1. Theauthentication request message sent by client A carries identificationinformation of client A.

The social network server may be implemented in any server in the socialnetwork, such as server 1, server 2 or server 3 in the social network.

At 102, upon receiving the authentication request message sent by theclient A, the social network server analyzes the authentication requestmessage and extracts the identification information of client A andidentification information of client B from the authentication requestmessage. Furthermore, the social network server identifies that thereare clients having direct social network relationship with client A andclient B, namely client C and client D. The social network server alsoextracts identification information of the receiving party, client B,from the authentication request message. Table 1′ having the samecontent as Table 1 is stored in a database of the social network server.According to the Table 1′ stored in the social network server, it isconfirmed that clients having direct social network relationship withclient B are client C and client D. In the present step, the socialnetwork server may inquire and ascertain that the clients having directsocial network relationship with client B include client C and client D.Upon receiving the authentication request message sent by client A, thesocial network server analyzes the authentication request message, andextracts identification information of client A of the receiving clientsfrom the authentication request message. With the same methodimplemented by client B, it is confirmed that the clients having directsocial network relationship with client A also include client C andclient D. Preferably, client C and client D have direct social networkrelationship with client A while client D and client C also have directsocial network relationship with client B. Of course, it may be the casethat client D and client C have direct social network relationship withclient B while client D and client C have indirect social networkrelationship with client A.

According to a predetermined rule, client C is selected from client Cand client D, and identification information of client C is obtained.The predetermined rule may be based on a social network relationshipchain which is the one with the highest sum of degrees of familiaritybetween client A and client B calculated by the social network serverautomatically. For example, given that the degree of familiarity ofclient A→client C→client B is Y1+X1 and the degree of familiarity ofanother social network relationship chain, client A→client D→client B,is Y2+X2, when Y1+X1>Y2+X2, client C is selected from client D andclient C, and identification information of client C is obtained.Otherwise, client D is selected. In the present embodiment, client C ispreferably selected. While the current step involves selecting client Dor client C by degree of familiarity, the selection performed betweenclient D and client C may be random without referring to degree offamiliarity.

Alternatively, the social network server, based on the numbers of clientidentities in the social network relationship table of client D and thesocial network relationship table of client C, may select one of clientD and client C. For example, when the social network relationship tableof client C has 10 client identities and the social network relationshiptable of client D has 100 client identities, since the number of theclient identities in the social network relationship table of client Cis less than that of client D, it is indicated that client C may be morecautious about screening his/her social network related objects, soclient C is selected. Of course, it may also be the case that when theratio of clients between the social network relationship tables ofclient B and client C is 1:10, and the ratio of clients between thesocial network relationship tables of client B and client D is 1:100,client C is selected. Alternatively, a threshold of ratio, such as 1:20for example, may be set. Accordingly, when the ratio of clients betweenthe social network relationship tables of client B and client C is 1:10,greater than the threshold of 1:20, and the ratio of clients between thesocial network relationship tables of client B and client D is 1:100,smaller than the threshold of 1:20, client C is selected.

Moreover, the social network server may automatically select client C orclient D which has the highest degree of familiarity with client B. Inthe event that X1>X2, the social network server selects client C;otherwise it selects client D. In the present embodiment, it ispreferable to select client C.

In addition to the approach where client C is selected in light of thepredetermined rule, it is possible to make the social network serversend the identification information of client D and client C to clientA. If client A selects client C, the social network server selectsclient C according to the selection of client A. On the other hand, ifclient A selects D, the social network server selects client D accordingto the selection of client A.

The overall degree of familiarity may be obtained in a fashion describedbelow. Assuming that the time period (such as 30 days for example)during which two clients have social network relationship is N, and atype of degree of familiarity corresponding to a unit time (such as 1day for example) is M, then the time weight of the degree of familiarityis N×M. Further, assuming that a type of degree of familiarity for thetwo clients to perform one information exchange in the unit time is P,the maximum of the degree of familiarity for the two clients to performinformation exchanges in the unit time is Pmax, and Pmax<P*Y (wherein Yis the maximum number of times where the two clients perform informationexchanges in the unit time, and if the unit time is 1 day, when 90information exchanges, then Pmax=90P). Through this way, the overalldegree of familiarity between two clients can be computed, by summingthe results of the types of degrees of familiarity, such as:X1=N1*M1+Min(Y*P, Pmax).

At 103, since there are numerous users in the social network, amountingto millions, in the present embodiment inverted indexes are previouslystored in distributed servers. It is to be understood that previousstorage of the inverted indexes is a preferred approach and the presentembodiment is not intended to limit the timing of when the invertedindexes are built. The inverted indexes may be built after theextraction of identification information of client A and identificationinformation of client B.

An inverted index is also known as an embedded file or an inverted file,and is an indexing method that is usually used to store a mapping of alocation (the value of the word location in the index) of a certain word(acting as the keyword for indexing) in a file or a set of files under afull text search. In the present embodiment, the social network of FIG.3 is described as an example for illustration. In the inverted index,the mutually bound identification information of client A andidentification information of client B (expressed as (A-B)) are taken asthe key for indexing. Given that the key is (A-B), information of thecommon social attributes between client A and client B is taken as thevalue, wherein the social attribute information represents theattributes possessed by a social network client that is corresponding toa client in the social network.

The social attribute information may be provided by the user atsubscribing to the social network and includes, for example, the user'sresidence in the city of Hangzhou, the user's company A, and may furtherinclude information generated as results of the user's activity in thesocial network, such as one representing the community where the userbelongs to, e.g., “World of Warcraft”. The social attribute informationmay be acquired from the user's log or from the database where theuser's subscription information is stored. The common social attributeinformation is extracted from individual user's social attributeinformation. For example, in a case where the value for indexing is{“Residence”→“Hangzhou”, “Company”→“Company A”, “Gender”→“male”,“Industry”→“electronic hardware”, “Game”→“World of Warcraft”}. Theinverted index stored in server 1 is shown in Table 3 below.

TABLE 3 Keyword Value (A-B) {“Residence” → “Hangzhou”, “Company” →“Company A”, “Gender”=>”male”, “Industry” → ”electronic hardware”,“Game” → ”World of Warcraft”} (A-C) {“Residence” → “Hangzhou”, “Company”→ “Company A”, “Gender” → ”male”, “Industry” → ”electronic hardware”,“Sports” → ”soccer”} (A-D) {“Residence” → “Hangzhou”, “Company” →“Company A”, “Gender” → ”male”, “IP” → ”196.168.0.*”, “Game” → ”World ofWarcraft”} (A-E) {“Residence” → “Hangzhou”, “Company” → “Company A”,“Gender” → ”male”, “Position” → ”sales” , “Game” → ”World of Warcraft” }

The social network server extracts identification information of clientA and identification information of client B according to theauthentication request message to obtain (A-B) as the keyword, andidentifies, from among server 1, server 2 and server 3, that server 1 isthe server which stores the inverted index having the keyword (A-B) inthe index records.

At 104, the social network server extracts index records with thekeyword of (A-B) from Table 3, and extracts the corresponding value (thecommon social attribute information between the client A and the clientB) {“Residence”→“Hangzhou”, “Company”→“Company A”, “Gender”→“male”,“Industry”→“electronic hardware”, “Game”→“World of Warcraft”}.

The social network server extracts index records having the keyword of(A-B), and extracts the relationship chain information between client Aand client B. The relationship chain information between client A andclient B used as the value for indexing represents that there isindirect social network relationship between two clients. For example,the clients A and D have a social relationship of category 2, andclients D and B have a social relationship of category 1. The value ofthe index with the keyword (A-B) is {(A-D, category 2), (D-B, category1)}. For example, client A and client C have a social relationship ofcategory 2, and client C and client B have a social relationship ofcategory 1. The value of another index with the keyword (A-B) is {(A-C,category 2), (C-B, category 1)}. The inverted index stored in server 1is shown in Table 4.

TABLE 4 Keyword Value (A-B) { A-D, category 2), (D-B, category 1)}; {A-C, category 2), (C-B, category 1)} (A-E) { A-B, category 2), (B-E,category 1)}

At 105, the social network server sends the extracted{“Residence”→“Hangzhou”, “Company”→“Company A”, “Gender”→“male”,“Industry”→“electronic hardware”, “Game”→“World of Warcraft”} to theclient B. By using {“Residence”→“Hangzhou”, “Company”→“Company A”,“Gender”→“male”, “Industry”→“electronic hardware”, “Game”→“World ofWarcraft”}, it is verified that the user corresponding to client A andthe user corresponding to client B have common attributes in the socialnetwork.

In addition, the social network server forwards the authenticationrequest message to client B, and attaches the authentication requestmessage with the information of the common social attributes, namely{“Residence”→“Hangzhou”, “Company”→“Company A”, “Gender”→“male”,“Industry”→“electronic hardware”, “Game”→“World of Warcraft”}. Ofcourse, the social network server may send the authentication requestmessage and the common social attribute information to client Bseparately, while the authentication request message and/or the commonsocial attribute information respectively carry information expressingthe correlation, so as to allow client B to tell that which receivedcommon social attribute information corresponds to which authenticationrequest message, and authenticates the authentication request messageaccording to the common social attribute information.

Alternatively, the social network server sends the extracted {(A-D,category 2), (D-B, category 1)} or {(A-C, category 2), (C-B, category1)} to client B. Through {(A-D, category 2), (D-B, category 1)} or{(A-C, category 2), (C-B, category 1)}, the relationship chaininformation between client A and client B is represented. As to therelationship chain information, when forwarding the authenticationrequest message to client B, the social network server attaches theauthentication request message with the common relationship chaininformation. Of course, the social network server may send theauthentication request message and the relationship chain informationbetween client A and client B to client B separately while theauthentication request message and/or the common social attributeinformation respectively carries information expressing theircorrelation, so as to allow client B to tell which received commonsocial attribute information corresponds to which authentication requestmessage, and authenticates the authentication request message accordingto the common social attribute information.

Further, at 103, if the social network server, according to the rule,selects client C from among the clients having direct social networkrelationship with client A and client B, the social network serverreplaces identification information of client A carried in theauthentication request message sent by client A with identificationinformation of client C in the manner that upon receiving theauthentication request message sent by client A, the social networkserver finds identification information of client A in theauthentication request message and changes it into identificationinformation of client C. The revised authentication request messageincludes identification information of client C and some revised textualdescription. The identification information of client C identifies theclient sending the revised authentication request message. An example ofthe revised textual description may be as follows: “client A requests tojoin Social Relationship Table 1”. Therefore, the revised authenticationrequest message would be read as: sending party=client C, textualdescription=“client A requests to join Social Relationship Table 1”. Theauthentication request message with the revised identificationinformation is then sent to client B while including identificationinformation of client C and some textual description originallycontained in the authentication request message sent by client A. Afterclient C is selected in light of the predetermined rule as describedpreviously, the authentication request message with the revisedidentification information can be sent to client C. Upon receiving “OK”as confirmation from client C, the social network server sends theauthentication request message with the revised identificationinformation to client B; otherwise, the authentication request messagewith the revised identification information is not sent to client B.

At 106, client B receives the authentication request message sent by theclient A requesting to establish social relationship in the form of asocial relationship message box, which exhibits {“Residence”→“Hangzhou”,“Company”→“Company A”, “Gender”→“male”, “Industry”→“electronichardware”, “Game”→“World of Warcraft”}.

A second embodiment of the present disclosure is a method 200 forprocessing an authentication request message in a social network. Themethod 200 as shown in FIG. 4 comprises actions described below.

At 201, client A sends an authentication request message to client Bthrough a social network server to request to establish socialrelationship with client B.

At 202, when detecting the authentication request message sent by clientA requesting to establish social relationship with client B, the socialnetwork server obtains identification information of client A andidentification information of client B.

At 203, according to identification information of client A andidentification information of client B, the social network serverdetermines from among a plurality of servers the server having A as thekeyword of index records as server 1 and the server having B as thekeyword of index records as server 2. Of course, if the inverted indexis stored in only one server, this step can be omitted. For example,when all the index records are stored in the social network server 1,the index records with A or B as the keyword are extracted from thesocial network server 1.

At 204, the social network server extracts from server 1 the socialattribute information of client A from the index records having keywordA, and, extracts from server 2 the social attribute information ofclient B.

At 205, from the social attribute information of client A and the socialattribute information of client B, information of social attribute thatare common to both clients A and B is extracted.

At 206, the social network server sends the extracted information ofcommon social attributes to client B.

At 207, client B displays the received information of social attributesthat are common to both client A and client B.

In the pre-stored inverted indexes of the present embodiment, theidentification information is used as key of indexes, and the socialattribute information of the clients of different identities as theindex values. For example, identification information of client A isused as a key, and the social attribute information of the client A isused as the corresponding index value while identification informationof client B is also used as a key, with the social attribute informationof the client B used as the corresponding index value. Thus, the indexvalue corresponding to the index having identification information ofclient A as key is as follows: {“Residence”→“Hangzhou”,“Company”→“Company A”, “Gender”→“male”, “Industry”→“electronichardware”, “Game”→“World of Warcraft”, “Sports”→“soccer”,“Position”→“sales”, etc.}. The index value corresponding to the indexhaving identification information of client B as key is as follows:{“Residence”→“Hangzhou”, “Company”→“Company A”, “Gender”→“male”,“Industry”→“electronic hardware”, “Game”→“World of Warcraft”,“Sports”→“table tennis”, “Position”→“financial staff”, etc.}. The socialnetwork server identifies the commonality between the above two valuesas {“Residence”→“Hangzhou”, “Company”→“Company A”, “Gender”→“male”,“Industry”→“electronic hardware”, “Game”→“World of Warcraft”}.

After 205, it is still possible for the system to automaticallydetermine the number of the extracted pieces of common social attributeinformation. If the number is 10, in excess of the preset firstthreshold of 9, the system will automatically add user A into user B'sSocial Relationship Table 1. If the number is 5, in excess of the presetsecond threshold of 4, the system will automatically add user A intouser B's Social Relationship Table 2.

A third embodiment of the present disclosure is an apparatus 300 forprocessing an authentication request message in a social network, whichis configured as shown in FIG. 5 and the components of which aredescribed below.

An acquisition module 301 detects an authentication request message sentby a first client to a second client requesting to establish a socialrelationship with the second client. The acquisition module 301 alsoobtains information of social attributes that are common to the firstclient and the second client, where the social attribute informationindicates the attribute(s) of a social network user in the socialnetwork.

A sending module 302 forwards the authentication request message and theobtained social attribute information to the second client. The socialattribute information is for the second client to decide to or not toauthenticate the authentication request message.

According to the identification information of the first client and acorrelation between the identification information and the socialattribute information of the first client, the acquisition module 301obtains social attribute information of the first client. According tothe identification information of the second client and a correlationbetween the identification information and the social attributeinformation of the second client, the acquisition module 301 obtainssocial attribute information of the second client. The acquisitionmodule 301 identifies the information of social attributes common toboth the first and second clients, based on the social attributeinformation of the first client and the social attribute information ofthe second client.

The acquisition module 301 searches for keywords of an inverted index toidentify index records in the inverted index with a keyword identical tothe identification information of the first client, and to identifyindex records in the inverted index and with a keyword identical to theidentification information of the second client, to obtain the socialattribute information of the first client and the social attributeinformation of the second from the identified index records. Theinverted index uses the identification information of clients as thekeywords of the index records and uses the clients' social attributeinformation as column values of the index records.

The acquisition module 301 identifies information of the socialattributes that are common to the first client and the second client,according to identification information of the mutually bound firstclient and the second client, as well as a correlation betweenidentification information of the two mutually bound clients and thesocial attribute information common to the two clients.

The acquisition module 301 further searches for a keyword of an invertedindex, identifies index records in the inverted index with the keywordidentical to the identification information of the mutually bound firstclient and second client, and obtains information of social attributescommon to the first client and the second client from the identifiedindex records. The inverted index uses the identification information ofthe two mutually bound clients as the keywords of the index records anduses the social attribute information common to the two clients ascolumn values of the index records.

The apparatus includes additional components that are described below.

An identifying module 303 determines, according to identificationinformation of the first client and identification information of thesecond client and from among a plurality of servers that store acorrelation between clients' identification information and clients'social attribute information, the server that stores the identificationinformation and social attribute information of the first client as wellas the server that stores the identification information and socialattribute information of the second client.

From the identified servers, the acquisition module 301 obtains theinformation of social attributes common to the first client and thesecond client.

The present disclosure has been described with reference to thepreferred embodiments and it is understood that the disclosedembodiments are not intended to limit the scope of the presentdisclosure. Moreover, as the contents disclosed herein is readilyunderstood and can be implemented by a person skilled in the art, allequivalent changes or modifications which do not depart from the conceptof the present disclosure are encompassed by the appended claims.

What is claimed is:
 1. A method for processing an authentication requestmessage in a social network, the method comprising: detecting, by asocial network server, that a first client sends the authenticationrequest message to a second client to request to establish a socialrelationship with the second client; determining one or more socialattributes shared by the first client and the second client by searchingin an index to identify one or more index records including socialnetwork activities shared by the first client and the second client, theone or more social attributes including multiple clients having socialconnections with the first client and the second client; determining aplurality of overall sums of degrees of familiarity, each of theplurality of overall sums corresponding to a respective overall sum ofthe degrees of familiarity between the first client, the second client,and one of the multiple clients, and each respective overall sum ofdegrees of familiarity being calculated by summing results of aplurality of predetermined types of determining familiarity between twoclients; identifying a third client among the multiple clients, thethird client being identified based on having a highest overall sum ofthe plurality of the overall sums of degrees of familiarity; andforwarding, by the social network server, the authentication requestmessage and information of the third client to the second client toenable the second client to determine whether or not to authenticate theauthentication request message.
 2. The method as claimed in claim 1,further comprising: obtaining social attribute information of the firstclient according to identification information of the first client and acorrelation between the identification information and the socialattribute information of the first client; and obtaining socialattribute information of the second client according to identificationinformation of the second client and a correlation between theidentification information and social attribute information of thesecond client.
 3. The method as claimed in claim 1, wherein the indexincludes multiple index records, and an individual index record of themultiple index records includes social network activities shared by atleast two clients and a key having identification information of the atleast two clients.
 4. The method as claimed in claim 1, furthercomprising: identifying, from a plurality of servers that storecorrelations between identification information and social attributeinformation of clients, one or more servers that store identificationinformation and social attribute information of the first client andidentification information and social attribute information of thesecond client based on the identification information of the firstclient and the second client.
 5. The method as claimed in claim 1,further comprising: selecting multidimensional social attributeinformation of the first client and the second client; and sending theselected multidimensional social attribute information to the secondclient.
 6. The method as claimed in claim 1, further comprisingestablishing a social relationship between the first client and thesecond client in response to a determination that a number of one ormore social attributes is greater than a predetermined value.
 7. Anapparatus for processing an authentication request message in a socialnetwork, the apparatus comprising: one or more processors; and memory tomaintain a plurality of components executable by the one or moreprocessors, the plurality of components comprising: an acquisitionmodule, that: detects the authentication request message sent by a firstclient to a second client requesting to establish a social relationshipwith the second client, determines one or more social attributes sharedby the first client and the second client by searching in an index toidentify one or more index records including social network activitiesshared by the first client and the second client, the one or more socialattributes including information of multiple clients having socialconnections with the first client and the second client, and identifies,from the multiple clients, a third client based on a comparison of anumber of social connections of each respective client of the multipleclients, the third client having a highest number of social connections,and a transmitting module, that forwards the authentication requestmessage and information of the third client to the second client therebyenabling the second client to use the social attribute information todecide whether or not to authenticate the authentication requestmessage.
 8. The apparatus as claimed in claim 7, wherein the acquisitionmodule further: obtains social attribute information of the first clientaccording to identification information of the first client and acorrelation between the identification information and social attributeinformation of the first client; and obtains social attributeinformation of the second according to identification information of thesecond client and a correlation between the identification informationand social attribute information of the second client.
 9. The apparatusas claimed in claim 8, wherein the index includes multiple indexrecords, and an individual index record of multiple index recordsincludes social network activities shared by at least two clients and akey having the identification information of the at least two clients.10. The apparatus as claimed in claim 7, further comprising: adetermination module, that identifies a first server of a plurality ofservers, that store correlations between identification information ofclients and social attribute information of clients, as storingidentification information and social attribute information of the firstclient, and further identifies a second server of the plurality ofservers as storing identification information and social attributeinformation of the second client according to the identificationinformation of the first client and the identification information ofthe second client.
 11. Non-transitory server memory storingcomputer-executable instructions that, when executed by one or moreprocessors, instruct the one or more processors to perform actscomprising: receiving a request of a first user for establishing asocial relationship with a second user; analyzing the request to extractan identification (ID) of the first user and an ID of the second user;performing a search using a key including the ID of the first user andthe ID of the second user to determine one or more common socialattributes that are shared by the first user and the second user;determining whether a number of the one or more common social attributesis greater than a predetermined value; in response to a determinationthat the number of the one or more common social attributes is greaterthan the predetermined value, automatically establishing a socialrelationship between the first user and the second user; and in responseto a determination that the number of the one or more common socialattributes is not greater than the predetermined value, transmitting therequest and the one or more common social attributes to a user deviceassociated with the second user.
 12. The non-transitory server memory ofclaim 11, wherein the acts further comprise determining a relationshipchain that includes one or more users having social relationships withthe first user and the second user.
 13. The non-transitory server memoryof claim 12, wherein the transmitting the request and the one or morecommon social attributes comprises transmitting the request, the one ormore common social attributes, and information associated with the oneor more users having social relationships with the first user and thesecond user.
 14. The non-transitory server memory of claim 12, whereinthe acts further comprise determining a third user from the relationshipchain based on a predetermined rule, and the transmitting the requestand the one or more social attributes comprises transmitting therequest, the one or more common social attributes, and identificationinformation of the third user.
 15. The non-transitory server memory ofclaim 11, wherein the performing the search comprises performing thesearch in an inverted index.
 16. The non-transitory server memory ofclaim 15, wherein the inverted index includes multiple index records,and an individual index record of the multiple index records includesocial network activities shared by two or more users and one key havingidentification information of the two or more users.
 17. Thenon-transitory server memory of claim 11, where the one or more socialattributes includes social network activities shared by the first userand the second user.
 18. The non-transitory server memory of claim 11,wherein the acts further comprise attaching the request with the one ormore common social attributes.
 19. The non-transitory server memory ofclaim 11, wherein the transmitting the request and the one or morecommon social attributes comprises separately transmitting the requestand the one or more social attributes.
 20. The apparatus as claimed inclaim 7, wherein the acquisition module further establishes a socialrelationship between the first client and the second client byautomatically adding the first client into a social network of thesecond client in response to a determination that a number of one ormore social attributes is greater than a predetermined value.